Numerical Studies of MacQueen’s k-Means Algorithm for Computing the Centroidal Voronoi Tessellations
نویسنده
چکیده
We study a probabilistic algorithm for the computation of the centroidal Voronoi tessellation which is a Voronoi tessellation of a given set such that the associated generating points are centroids (centers of mass) of the corresponding Voronoi regions. We discuss various issues related to the implementation of the algorithm and provide numerical results. Some measures to improve the performance are also presented. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Centroidal Voronoi tessellations, Probabilistic methods, k-means algorithms.
منابع مشابه
Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a bounded geometric domain such that the generating points of the tessellations are also the centroids (mass centers) of the corresponding Voronoi regions with respect to a given density function. Centroidal Voronoi tessellations may also be defined in more abstract and more general settings. Due to the natural optimization pr...
متن کاملApproximations of a Ginzburg-Landau model for superconducting hollow spheres based on spherical centroidal Voronoi tessellations
In this paper the numerical approximations of the GinzburgLandau model for a superconducting hollow spheres are constructed using a gauge invariant discretization on spherical centroidal Voronoi tessellations. A reduced model equation is used on the surface of the sphere which is valid in the thin spherical shell limit. We present the numerical algorithms and their theoretical convergence as we...
متن کاملCentroidal Voronoi Tessellations : Applications and Algorithms ∗ Qiang Du
A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the corresponding Voronoi regions. We give some applications of such tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals. We discuss methods f...
متن کاملConstrained Centroidal Voronoi Tessellations for Surfaces
Abstract. Centroidal Voronoi tessellations are useful for subdividing a region in Euclidean space into Voronoi regions whose generators are also the centers of mass, with respect to a prescribed density function, of the regions. Their extensions to general spaces and sets are also available; for example, tessellations of surfaces in a Euclidean space may be considered. In this paper, a precise ...
متن کاملAcceleration schemes for computing centroidal Voronoi tessellations
Centroidal Voronoi tessellations (CVT) have diverse applications in many areas of science and engineering. The development of e cient algorithms for their construction is a key to their success in practice. In this paper, we study some new algorithms for the numerical computation of the CVT, including the Lloyd–Newton iteration and the optimization based multilevel method. Both theoretical anal...
متن کامل